NoMoRe : Non-monotonic Reasoning with Logic Programs

The non-monotonic reasoning system noMoRe [2] implements answer set semantics for normal logic programs. It realizes a novel, rule-based paradigm to compute answer sets by computing non-standard graph colorings of the block graph associated with a given logic program (see [6, 8, 7] for details). These non-standard graph colorings are called a-colorings or application-colorings since they reflect the set of generating rules (applied rules) for an answer set. Hence noMoRe is rule-based and not atom-based like most of the other known systems. In the recent release of noMoRe we have newly implemented backward propagation of partial a-colorings and a technique called jumping in order to ensure full (backward) propagation [8]. Both techniques improve the search space pruning of noMoRe. Furthermore, we have extended the syntax by integrity, weight and cardinality constraints [11, 5]1. The noMoRe-system is implemented in the programming language Prolog; it has been developed under the ECLiPSe Constraint Logic Programming System [1] and it was also successfully tested with SWI-Prolog [12]. The system is available at http://www.cs.unipotsdam.de/ ̃linke/nomore. In order to use the system, ECLiPSeor SWI-Prolog is needed [1, 12]2.